Computing with planar toppling domino arrangements
نویسندگان
چکیده
منابع مشابه
Parity Theorems for Statistics on Domino Arrangements
We study special values of Carlitz’s q-Fibonacci and q-Lucas polynomials Fn(q, t) and Ln(q, t). Brief algebraic and detailed combinatorial treatments are presented, the latter based on the fact that these polynomials are bivariate generating functions for a pair of statistics defined, respectively, on linear and circular domino arrangements.
متن کاملArrangements of Planar Curves
Computing arrangements of curves is a fundamental and challenging problem in computational geometry as leading to many practical applications in a wide range of fields, especially in robot motion planning and computer vision. In this survey paper we present the state of the art for computing the arrangement of planar curves, considering various classes of curves, from lines to arbitrary curves.
متن کاملToppling Manipulation
This paper describes a robotic manipulation primitive called toppling—knocking a part over. We derive the mechanical conditions for toppling, express these as constraints on robot contact locations and motions, and describe an application of toppling to minimalist parts feeding of 3D objects on a conveyor with a 2 joint robot.
متن کاملGeneralization of a Statistic on Linear Domino Arrangements
In this paper, we generalize an earlier statistic on square-and-domino tilings by considering only those squares covering a multiple of k, where k is a fixed positive integer. We consider the distribution of this statistic jointly with the one that records the number of dominos in a tiling. We derive both finite and infinite sum expressions for the corresponding joint distribution polynomials, ...
متن کاملTwo randomized incramental algorithms for planar arrangements, with a twist
We present two results related to randomized incremental construction of planar arrangements: • An algorithm for computing the union of triangles in the plane in a quasi outputsensitive time. • A more efficient alternative to vertical decomposition of arrangements of lines in the plane, called polygonal decomposition. An efficient randomized incremental algorithm for its construction is present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2012
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-012-9341-x